General Caching Is Hard: Even with Small Pages
نویسندگان
چکیده
منابع مشابه
Parallel Prefetching and Caching Is Hard
In this paper we study integrated prefetching and caching in parallel disk systems. This topic has gained a lot of interest in the last years which manifests itself in numerous recent approximation algorithms. This paper provides the first negative result in this area by showing that optimizing the stall time is APX hard. This also implies that computing the optimal processing time is NP-hard, ...
متن کاملTetris is Hard, Even to Approximate
Figure 1: The tetrominoes Sq (“square”), LG (“left gun”), RG (“right gun”), LS (“left snake”), RS (“right snake”), I, and T, with each piece’s center marked. of the top row of the gameboard, and falls downward at a constant speed. As it falls, the player can rotate the piece and slide it horizontally. If, when the piece comes to rest, all gridsquares in an entire row h of the gameboard are fill...
متن کاملDissection with the Fewest Pieces is Hard, Even to Approximate
We prove that it is NP-hard to dissect one simple orthogonal polygon into another using a given number of pieces, as is approximating the fewest pieces to within a factor of 1 + 1/1080 − ε.
متن کاملClickomania is Hard, Even with Two Colors and Columns
Clickomania is a classic computer puzzle game (also known as SameGame, Chain-Shot!, and Swell-Foop, among other names). Originally developed by Kuniaki “Morisuke” Moribe under the name Chain-Shot! for the Fujitsu FM-8, and announced in the November 1985 issue of ASCII Monthly magazine, it has since been made available for a variety of digital platforms [Mor03]. Figure 1 shows some examples. Alt...
متن کاملGeneral Caching with Lifetimes
We consider the problem of caching with lifetimes, where a lifetime is specified whenever a page is loaded into the cache. The copy of a page loaded into the cache may be used to serve requests to the same page, only until its expiration time. We present a generic method to get an algorithm for caching with lifetimes, from an algorithm for caching without lifetimes. This method works for any co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0185-0